A Constraint-Based Approach to the Golomb Ruler Problem
نویسندگان
چکیده
A Golomb ruler with m marks can be defined as a set of m distinct integers such that the differences between them are all distinct. An optimal Golomb ruler minimizes the value of the largest mark. The Golomb ruler problem is highly combinatorial and difficult to solve efficiently even for small sizes. Golomb rulers and related problems play an important role in, e.g., radio communication, VLSI architectures, convolutional selforthogonal codes and radio-astronomy. We propose a combination of constraint programming and improved lower bounds in order to solve it. In particular, we introduce a new lower bound based on minimum weight matchings and multi-decompositions. Experimental results are given.
منابع مشابه
Modelling the Golomb Ruler Problem
The Golomb ruler problem has been proposed as a challenging constraint satisfaction problem. We consider a large number of diierent models of this problem, both binary and non-binary. The problem can be modelled using quaternary constraints, but in practice using a set of auxiliary variables and ternary constraints gives better results. A binary encoding of the problem gives a smaller search tr...
متن کاملModelling the Golomb Ruler
The Golomb ruler problem has been proposed as a challenging constraint satisfaction problem. We consider a large number of di erent models of this problem, both binary and non-binary. The problem can be modelled using quaternary constraints, but in practice using a set of auxiliary variables and ternary constraints gives better results. A binary encoding of the problem gives a smaller search tr...
متن کاملA Lagrangian Relaxation for Golomb Rulers
The Golomb Ruler Problem asks to position n integer marks on a ruler such that all pairwise distances between the marks are distinct and the ruler has minimum total length. It is a very challenging combinatorial problem, and provably optimal rulers are only known for n up to 26. Lower bounds can be obtained using Linear Programming formulations, but these are computationally expensive for large...
متن کاملSome Implementation Results on Random Polling Dynamic Load Balancing 2 Sequential Algorithms
Using two sample applications, we demonstrate the eeectiveness of our portable and reusable library for parallel tree search. On 1024 Transputers we achieve near optimal speedup even for quite small instances of the Golomb ruler problem. The 0/1 knapsack problem is more challenging but it is possible to achieve superlinear speedup compared to the standard sequential depth rst algorithm the impl...
متن کاملUsing Auxiliary Variables and Implied Constraints to Model Non-Binary Problems
We perform an extensive theoretical and empirical analysis of the use of auxiliary variables and implied constraints in modelling a class of non-binary constraint satisfaction problems called problems of distance. This class of problems include 1-d, 2-d and circular Golomb rulers. We identify a large number of different models, both binary and non-binary, and compare theoretically the level of ...
متن کامل